Optimal non-adaptive solutions for the counterfeit coin problem
نویسنده
چکیده
We give optimal solutions to all versions of the popular counterfeit coin problem obtained by varying whether (i) we know if the counterfeit coin is heavier or lighter than the genuine ones, (ii) we know if the counterfeit coin exists, (iii) we have access to additional genuine coins, and (iv) we need to determine if the counterfeit coin is heavier or lighter than the genuine ones. Moreover, our solutions are non-adaptive.
منابع مشابه
Algorithms for the Coin Weighing Problems with the Presence of Noise
The coin weighing problem is the following: Given n coins for which m of them are counterfeit with the same weight. The problem is to detect the counterfeit coins with minimal number of weighings. This problem has many applications in compressed sensing, multiple access adder channels, etc. This problem was solved when m is unknown. An old optimal non-adaptive polynomial time algorithm of Linds...
متن کاملOptimal Algorithms for the Coin Weighing Problem with a Spring Scale
Suppose we are given n coins out of a collection of coins of two distinct weights w0 and w1, true and counterfeit coins, respectively, where d of them are counterfeit coins. Assume we are allowed to weigh subsets of coins in a spring scale. Determine the counterfeit coins in a minimal number of weighing. This problem is equivalent to the following learning problem: Given a linear function f = x...
متن کاملoptimal Detection of a Counterfeit Coin with Multi-arms Balances
We consider the problem of locating a light coin out of a set containing n coins, n ? 1 of which have the same weight. The weighing device is a balance with r 2 pans and, when r equally sized subset of coins are weighted, it indicates the eventual subset containing the light coin. We give an algorithm to nd the counterfeit coin that requires the minimum possible average number of weighings. All...
متن کاملEquivalent a posteriori error estimates for spectral element solutions of constrained optimal control problem in one dimension
In this paper, we study spectral element approximation for a constrained optimal control problem in one dimension. The equivalent a posteriori error estimators are derived for the control, the state and the adjoint state approximation. Such estimators can be used to construct adaptive spectral elements for the control problems.
متن کاملAn Advanced Approach to Solve two Counterfeit Coins Problem
Though the counterfeit coin problem is well known as a fascinating puzzle it claims great importance in Computer science, Game theory, and Mathematics. In terms of the puzzle the objective is to detect the counterfeit coins which are identical in appearance but different in weight. The word counterfeit not only describes forgeries of currency or documents, but can also be applied to software, p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1502.04896 شماره
صفحات -
تاریخ انتشار 2015